Anonymous types for statically typed queries

ABSTRACT

Anonymous types for a programming language. Non-denotable anonymous types are types that a compiler generates on behalf of a programmer and can then be used as nominal types. Insofar as anonymous types do not have a name, they can be used only inside a method in which they are created. Additionally, an anonymous type cannot be exposed in any way outside of the method. Syntax to create an anonymous type is useful when employed with a Select operator to generate a result with a particular shape, without the need of having a regular type for it. Anonymous types are expressible such that an expression of that type can be written. Translation of an anonymous type by a compiler generates a nominal class that implements Equals and GetHashCode methods. There is equivalence of anonymous types within the same method, and conversion of an unrealized structural type into structurally compatible nominal type.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of, and claims the benefit of, andpriority to, U.S. application Ser. No. 11/193,601, filed on Jul. 29,2005 and entitled “ANONYMOUS TYPES FOR STATICALLY TYPED QUERIES” (nowU.S. Pat. No. ______), which application is expressly incorporatedherein by this reference in its entirety.

BACKGROUND

The advent of global communications networks (e.g., the Internet) nowmakes accessible an enormous amount of data. People access and queryunstructured and structured data every day. Unstructured data is usedfor creating, storing and retrieving reports, e-mails, spreadsheets andother types of documents, and consists of any data stored in anunstructured format at an atomic level. In other words, in theunstructured content, there is no conceptual definition and no data typedefinition—in textual documents, a word is simply a word. Currenttechnologies used for content searches on unstructured data requiretagging entities such as names or applying keywords and metatags.Therefore, human intervention is required to help make the unstructureddata machine readable. Structured data is any data that has an enforcedcomposition to the atomic data types. Structured data is managed bytechnology that allows for querying and reporting against predetermineddata types and understood relationships.

One of the more important query operations is projection or selectionthat given a collection of values, selects a subset of the members ofeach value in the collection. For example, in a relation of bookscontaining the attributes author and title, the formation of a list ofthe titles of the books written by a particular author. In anotherexample, the following SQL (structured query language) query returnsjust the Name and Age of each employee Pin the table Employees.

Select P.Name, P.Age From Employees As P

The Employees table itself has more columns, such as EmployeeID, Salary,OfficeNumber, Division, etc., which are projected down to just the Nameand Age columns A problem faced with select queries such as the above isthat the result set contains rows of the form {string Name; int Age}.That is, it is known that each value in the result set has a Name columnof type string and an Age column of type int. Unfortunately, in anominal type system such as the common language runtime, there is notype that describes those values.

SUMMARY

The following presents a simplified summary in order to provide a basicunderstanding of some aspects of the disclosed innovation. This summaryis not an extensive overview, and it is not intended to identifykey/critical elements or to delineate the scope thereof. Its solepurpose is to present some concepts in a simplified form as a prelude tothe more detailed description that is presented later.

The disclosed innovation introduces a notion of anonymous types, whichin one application, can be used to statically type Select queries.

It is often inconvenient to create a separate type for each query resultof a query. This becomes more important as the number of queries grow.Anonymous types are types that the compiler generates on behalf of theprogrammer and can then be used as “normal” (e.g., nominal) types.Insofar as anonymous types do not have a name, it is possible to usethem only inside a method in which they are created. Additionally,anonymous types cannot be exposed in any way outside of the method. Thesyntax to create an anonymous type is particularly useful when employedwith a Select operator to generate a result with a particular shape,without the need of having a regular type for it.

The invention disclosed and claimed herein, in one aspect thereof,comprises architecture that employs anonymous types. A system includes aquery component that facilitates generating a query of data (e.g.,structured or unstructured). Interface to the query component is a typecomponent that automatically generates a non-denotable type (or ananonymous type) in response to the query, and in accordance with a novelaspect.

In another aspect of the innovation, anonymous types are expressiblesuch that an expression of that type can be written. Anonymous types arenon-denotable in that the type cannot be written down. As a consequence,variables of anonymous types use type inference.

In another aspect thereof, implementation of an anonymous type bytranslation into a compiler generates a nominal type that implementsEquals and GetHashCode methods.

In yet another aspect, there is equivalence of anonymous types withinthe same method.

In still another aspect of the disclosed innovation, there is disclosedthe conversion of an unrealized structural type into structurallycompatible nominal type.

To the accomplishment of the foregoing and related ends, certainillustrative aspects of the disclosed innovation are described herein inconnection with the following description and the annexed drawings.These aspects are indicative, however, of but a few of the various waysin which the principles disclosed herein can be employed and is intendedto include all such aspects and their equivalents. Other advantages andnovel features will become apparent from the following detaileddescription when considered in conjunction with the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a system that employs anonymous types in accordancewith the disclosed innovation.

FIG. 2 illustrates a methodology of providing anonymous types inaccordance with an aspect

FIG. 3 illustrates a flow diagram of a methodology of utilizinganonymous types in a Select statement.

FIG. 4 illustrates a methodology of processing an anonymous type forpassing values, according to an aspect.

FIG. 5 illustrates a methodology of processing an unrealized type into anominal type.

FIG. 6 illustrates a flow diagram of a methodology of compatibilitytesting in accordance with an aspect.

FIG. 7 illustrates a use of anonymous types.

FIG. 8 illustrates syntax for anonymous types.

FIG. 9 illustrates a system the employs the type component of FIG. 1 aspart of a compiler.

FIG. 10 illustrates a system where the type component is external to thecompiler.

FIG. 11 illustrates a system where the compiler is included as part ofthe type component.

FIG. 12 illustrates a block diagram of a computer operable to processanonymous types of the disclosed architecture.

FIG. 13 illustrates a schematic block diagram of an exemplary computingenvironment that can employ anonymous types.

DETAILED DESCRIPTION

The innovation is now described with reference to the drawings, whereinlike reference numerals are used to refer to like elements throughout.In the following description, for purposes of explanation, numerousspecific details are set forth in order to provide a thoroughunderstanding thereof. It may be evident, however, that the innovationcan be practiced without these specific details. In other instances,well-known structures and devices are shown in block diagram form inorder to facilitate a description thereof.

As used in this application, the terms “component” and “system” areintended to refer to a computer-related entity, either hardware, acombination of hardware and software, software, or software inexecution. For example, a component can be, but is not limited to being,a process running on a processor, a processor, a hard disk drive,multiple storage drives (of optical and/or magnetic storage medium), anobject, an executable, a thread of execution, a program, and/or acomputer. By way of illustration, both an application running on aserver and the server can be a component. One or more components canreside within a process and/or thread of execution, and a component canbe localized on one computer and/or distributed between two or morecomputers.

It is often inconvenient to create a separate type for each query resultof a query. This becomes more important as the number of queries grow.Anonymous types are types that the compiler generates on behalf of theprogrammer and can then be used as “normal” (e.g., nominal) types.Insofar as anonymous types do not have a name (i.e., they arenon-denotable), it is possible to use them only inside a method in whichthey are created. Additionally, anonymous type cannot be exposed in anyway outside of the method.

Anonymous types can be most often used in conjunction with typeinference, exemplified as in the following snippet of code:

var info=new {Name=“Bob”, City=“Rome”};

The syntax to create an anonymous type resembles object initializers,where the type to be created is omitted. Object initializers are thesubject of another patent application entitled “EXTENDINGEXPRESSION-BASED SYNTAX FOR CREATING OBJECT INSTANCES” filed Aug. 1,2005, by the inventors of this application and assigned to the presentassignee. An object initializer specifies values for one or more fieldsor properties of a newly-created object. This syntax is particularlyuseful when employed with a Select operator to generate a result with aparticular shape, without the need of having a regular type for it, asexemplified in the following code:

  var info = Customers.Select(|c| new Contact {Name = c.Name, City =c.City});

The disclosed innovation introduces a notion of anonymous types, whichin one application, can be used to statically type Select queries.

Referring initially to the drawings, FIG. 1 illustrates a system 100that employs anonymous types in accordance with the disclosedinnovation. The system 100 includes a query component 102 thatfacilitates generating a query of data (e.g., structured orunstructured). Interface to the query component 102 is a type component104 that automatically generates a non-denotable type (or an anonymoustype) in response to the query, and in accordance with a novel aspect.

FIG. 2 illustrates a methodology of providing anonymous types inaccordance with an aspect. While, for purposes of simplicity ofexplanation, the one or more methodologies shown herein, e.g., in theform of a flow chart or flow diagram, are shown and described as aseries of acts, it is to be understood and appreciated that the subjectinnovation is not limited by the order of acts, as some acts may, inaccordance therewith, occur in a different order and/or concurrentlywith other acts from that shown and described herein. For example, thoseskilled in the art will understand and appreciate that a methodologycould alternatively be represented as a series of interrelated states orevents, such as in a state diagram. Moreover, not all illustrated actsmay be required to implement a methodology in accordance with theinnovation.

At 200, a query is received for processing. At 202, a compile process isinitiated by the compiler. At 204, the query expression is processed anda non-denotable type is outputted. At 206, the non-denotable type isconverted to a nominal type by the compiler. In effect, thenon-denotable type is an anonymous type that is represented by asynthesized nominal type.

There are many scenarios where programmers desire to return structureddata, but do not want to create a nominal type definition. As describedherein, the result set of a Select statement is a prototypical exampleof this. To support creating structured data without using nominaltypes, anonymous types can be employed. For example, the SQL (structuredquery language) query above can be written by returning values of theform new{Name=e. Name, Age=e.Age}.

  var results = Employees.Select(|e| new{ Name = e.Name, Age = e.Age })

Anonymous types are expressible. That is, they can be the result of anexpression as in new {Name=e. Name, Age=e. Age}, but they are notdenotable (referred herein as non-denotable). In other words, there isno syntax to write down the type. As a result, an explicitly-typedvariable of an anonymous type is not declared. Instead, in oneimplementation, type inference is employed. When a generic method iscalled without specifying type arguments, the type inference processattempts to infer type arguments for the call. Type inference allows thetype of a variable to be inferred from the expression that is assignedto it. This has practical utility whenever the explicit creation oridentification of a type is complex or tedious for the programmer.

Accordingly, FIG. 3 illustrates a flow diagram of a methodology ofutilizing anonymous types in a Select statement. At 300, Select query isreceived for processing. At 302, a compile of the query expression isinitiated. At 304, the query expression is processed to include ananonymous type. At 306, the anonymous type is employed as a staticallytyped Select query.

The results variable above in the Employees. Select example, does have astatic type. Using pseudo code, the static type looks like IEnumerable<. . . a type with a field Name of type string and a field Age of typeInt . . . >, for example, but as described supra, it cannot be writtendown. The results collection can be iterated over and the Name and Agefields accessed, since the compiler itself has knowledge of thestructure of the anonymous type:

   foreach(r in results)    {    ...; string s = r.Name; int n = r.Age;... //OK    ...;  Button b = r.Button; ... //Static type error, r doesnot have a Button field.    }

A reason that anonymous types are not denotable is that the underlyingCLR (common language runtime) execution engine does not support themdirectly, but only supports structured nominal types. Instead, thecompiler emits a “normal” class definition with a multi-character (or“mangled”) name that has field for each field in the anonymous type, andoverrides Equals and GetHashCode methods. For example, the expressionnew {Name=e. Name, Age=e. Age} could be compiled into a constructor callnew C$235 {Name=e. Name, Age=e. Age} where class C$235 {string Name; intAge; public override bool Equals(object other) { . . . }; publicoverride int GetHashCode( )} is anew compiler-generated or synthesizednominal type. Note that the synthesized type can use properties insteadof fields as an alternative.

Equivalence of anonymous types. The type correctness rules for anonymoustypes can be implied by the translation into a compiler-generatednominal type. Additionally, anonymous types are equivalent within thescope of a method. Thus, for example, the assignment x=y below is validbecause x and y will have the same compiler-generated type:

void F( ) {  var x = new{ x = 47, y = 11 };  var y = new{ x = 7, y = 42};  x = y; // }

Conversion from anonymous types to compatible nominal types, and nominaltypes to anonymous types. Since the type of an anonymous type cannot bewritten down, the anonymous type is not a first class citizen in thesense that values of an anonymous type cannot be passed as arguments tomethods, or returned as results from non-generic methods. It is also tobe appreciated that conversion can be performed from a nominal type toan anonymous type where the values are sufficiently compatible.

   g(f(Employees));    ??? f(IEnumerable<Employee> Employees)    {     var results = Employees.Select(|e| new{ Name = e.Name, Age = e.Age});      return results;    }    void g(??? results)    { foreach(r inresults) { ...; string s = r.Name; int n = r.Age; ... //OK ...;  Buttonb = r.Button;11  ... //Static type error, r does not have a Buttonfield. }    }

Note that anonymous type can be bound to type variable, as in thefollowing example.

static void F<T>(T t)  { ...t... } var x = new { a = 5, b = “hello” };F(x); // T will be bound to the compiler generated type for x

However, there is not much that can be done with t inside F. In orderpass values of anonymous types around in a useful way, they should firstbe converted to a known nominal type. Accordingly, FIG. 4 illustrates amethodology of processing an anonymous type for passing values,according to an aspect. At 400, an anonymous type is received having oneor more values. At 402, the anonymous type is converted to a nominaltype having some or all of the one or more values. At 404, the one ormore values of the nominal type can now be passed as requested.

One methodology of conversion is to use a mechanism similar to anonymousmethods to determine the element type of a query. For example:

sequence<Contact>  contacts  =  db.Customers.Where(|c|  c.State ==“WA”).Select(|c| new{Name, Phone});

Here, the result of the .Select operator is an “unrealized structuraltype”. An unrealized structural type is either converted to a nominaltype through type inference or converted to a compiler-generated nominaltype when no inference can be made. For example, had the left hand sideabove been “object contacts= . . . ”, or “var contacts” then the resultof the query would have been an anonymous type.

Accordingly, FIG. 5 illustrates a methodology of processing anunrealized type into a nominal type. At 500, an unrealized structuraltype is received for processing. At 502, conversion of the unrealizedstructural type to a nominal type is initiated. At 504, the systemdetermines if type inference can be employed. If so, flow is to 506where type inference is employed to convert the unrealized structuraltype to a nominal type. Alternatively, if type inference cannot beemployed, flow is from 504 to 508 where conversion is to acomplier-generated nominal type.

An unrealized anonymous type T is compatible with a nominal N if all thefields in T are compatible with corresponding members in N. A field m oftype R is compatible with a property or field m of type S where T isimplicitly convertible to S. The realization of a value x of theunrealized type T is via the creation of an instance new N{ . . . m=x.m;. . . }.

The notion of compatibility can be applied recursively. Consider thefollowing example:

IEnumerable<ProductsByCategory>  x  =  db.Products.GroupBy(|p|p.Category). Select(|g| new { Category = g.Key, Products =g.Group.Select(|p| new{ ProductId, ProdName});

FIG. 6 illustrates a flow diagram of a methodology of compatibilitytesting in accordance with an aspect. At 600, an unrealized structuraltype is received for processing. At 602, compatibility with a nominaltype is tested via field and member relationships of the types. At 604,an instance is created to realize a value of an unrealized structuraltype. At 606, if desired, compatibility can be applied recursively.

The type of the query can be the following unrealized structural type:

 IEnumerable<  ...a  type  with  a  field  string  Category  and  afield    IEnumerable<... a type with a field int ProductId and a fieldstring ProductName ...> Products...  >

A top-level anonymous type is compatible with the nominal typeProductsByCategory, while the nested anonymous type is compatible withProduct, as illustrated in the following example:

class ProductsByCategory  {  string Category;  IEnumerable<Product>Products; } class Product  {  int ProductId;  string ProductName; }

FIG. 7 illustrates a use of anonymous types. Here, a non-denotable class“???” is generated when the anonymous type is processed.

FIG. 8 illustrates syntax for anonymous types which can be defined by,but is not limited to, the following grammar:

primary-no-array-creation-expression:    ...   anonymous-object-creation-expressionanonymous-object-creation-expression:    newanonymous-object-initializer anonymous-object-initializer:   {  member-declarator-listopt  }    {  member-declarator-list  ,  }member-declarator-list:    member-declarator    member-declarator-list ,member-declarator member-declarator:    simple-name    member-access   identifier  =  expressionThe syntax builds upon the object initializer mechanism referencedsupra. It is to be appreciated that other suitable syntax can beemployed.

FIG. 9 illustrates a system 900 the employs the type component 104 ofFIG. 1 as part of a compiler 902.

FIG. 10 illustrates a system 1000 where the type component 104 isexternal to the compiler 902.

FIG. 11 illustrates a system 1100 where the compiler 1102 is included aspart of the type component 104.

Referring now to FIG. 12, there is illustrated a block diagram of acomputer operable to execute the disclosed anonymous type architecture.In order to provide additional context for various aspects thereof, FIG.12 and the following discussion are intended to provide a brief, generaldescription of a suitable computing environment 1200 in which thevarious aspects of the innovation can be implemented. While thedescription above is in the general context of computer-executableinstructions that may run on one or more computers, those skilled in theart will recognize that the innovation also can be implemented incombination with other program modules and/or as a combination ofhardware and software.

Generally, program modules include routines, programs, components, datastructures, etc., that perform particular tasks or implement particularabstract data types. Moreover, those skilled in the art will appreciatethat the inventive methods can be practiced with other computer systemconfigurations, including single-processor or multiprocessor computersystems, minicomputers, mainframe computers, as well as personalcomputers, hand-held computing devices, microprocessor-based orprogrammable consumer electronics, and the like, each of which can beoperatively coupled to one or more associated devices.

The illustrated aspects of the innovation may also be practiced indistributed computing environments where certain tasks are performed byremote processing devices that are linked through a communicationsnetwork. In a distributed computing environment, program modules can belocated in both local and remote memory storage devices.

A computer typically includes a variety of computer-readable media.Computer-readable media can be any available media that can be accessedby the computer and includes both volatile and non-volatile media,removable and non-removable media. By way of example, and notlimitation, computer-readable media can comprise computer storage mediaand communication media. Computer storage media includes both volatileand non-volatile, removable and non-removable media implemented in anymethod or technology for storage of information such ascomputer-readable instructions, data structures, program modules orother data. Computer storage media includes, but is not limited to, RAM,ROM, EEPROM, flash memory or other memory technology, CD-ROM, digitalvideo disk (DVD) or other optical disk storage, magnetic cassettes,magnetic tape, magnetic disk storage or other magnetic storage devices,or any other medium which can be used to store the desired informationand which can be accessed by the computer.

Communication media typically embodies computer-readable instructions,data structures, program modules or other data in a modulated datasignal such as a carrier wave or other transport mechanism, and includesany information delivery media. The term “modulated data signal” means asignal that has one or more of its characteristics set or changed insuch a manner as to encode information in the signal. By way of example,and not limitation, communication media includes wired media such as awired network or direct-wired connection, and wireless media such asacoustic, RF, infrared and other wireless media. Combinations of the anyof the above should also be included within the scope ofcomputer-readable media.

With reference again to FIG. 12, the exemplary environment 1200 forimplementing various aspects includes a computer 1202, the computer 1202including a processing unit 1204, a system memory 1206 and a system bus1208. The system bus 1208 couples system components including, but notlimited to, the system memory 1206 to the processing unit 1204. Theprocessing unit 1204 can be any of various commercially availableprocessors. Dual microprocessors and other multi-processor architecturesmay also be employed as the processing unit 1204.

The system bus 1208 can be any of several types of bus structure thatmay further interconnect to a memory bus (with or without a memorycontroller), a peripheral bus, and a local bus using any of a variety ofcommercially available bus architectures. The system memory 1206includes read-only memory (ROM) 1210 and random access memory (RAM)1212. A basic input/output system (BIOS) is stored in a non-volatilememory 1210 such as ROM, EPROM, EEPROM, which BIOS contains the basicroutines that help to transfer information between elements within thecomputer 1202, such as during start-up. The RAM 1212 can also include ahigh-speed RAM such as static RAM for caching data.

The computer 1202 further includes an internal hard disk drive (HDD)1214 (e.g., EIDE, SATA), which internal hard disk drive 1214 may also beconfigured for external use in a suitable chassis (not shown), amagnetic floppy disk drive (FDD) 1216, (e.g., to read from or write to aremovable diskette 1218) and an optical disk drive 1220, (e.g., readinga CD-ROM disk 1222 or, to read from or write to other high capacityoptical media such as the DVD). The hard disk drive 1214, magnetic diskdrive 1216 and optical disk drive 1220 can be connected to the systembus 1208 by a hard disk drive interface 1224, a magnetic disk driveinterface 1226 and an optical drive interface 1228, respectively. Theinterface 1224 for external drive implementations includes at least oneor both of Universal Serial Bus (USB) and IEEE 1394 interfacetechnologies. Other external drive connection technologies are withincontemplation of the subject innovation.

The drives and their associated computer-readable media providenonvolatile storage of data, data structures, computer-executableinstructions, and so forth. For the computer 1202, the drives and mediaaccommodate the storage of any data in a suitable digital format.Although the description of computer-readable media above refers to aHDD, a removable magnetic diskette, and a removable optical media suchas a CD or DVD, it should be appreciated by those skilled in the artthat other types of media which are readable by a computer, such as zipdrives, magnetic cassettes, flash memory cards, cartridges, and thelike, may also be used in the exemplary operating environment, andfurther, that any such media may contain computer-executableinstructions for performing the methods of the disclosed innovation.

A number of program modules can be stored in the drives and RAM 1212,including an operating system 1230, one or more application programs1232, other program modules 1234 and program data 1236. All or portionsof the operating system, applications, modules, and/or data can also becached in the RAM 1212. It is to be appreciated that the innovation canbe implemented with various commercially available operating systems orcombinations of operating systems.

A user can enter commands and information into the computer 1202 throughone or more wired/wireless input devices, e.g., a keyboard 1238 and apointing device, such as a mouse 1240. Other input devices (not shown)may include a microphone, an IR remote control, a joystick, a game pad,a stylus pen, touch screen, or the like. These and other input devicesare often connected to the processing unit 1204 through an input deviceinterface 1242 that is coupled to the system bus 1208, but can beconnected by other interfaces, such as a parallel port, an IEEE 1394serial port, a game port, a USB port, an IR interface, etc.

A monitor 1244 or other type of display device is also connected to thesystem bus 1208 via an interface, such as a video adapter 1246. Inaddition to the monitor 1244, a computer typically includes otherperipheral output devices (not shown), such as speakers, printers, etc.

The computer 1202 may operate in a networked environment using logicalconnections via wired and/or wireless communications to one or moreremote computers, such as a remote computer(s) 1248. The remotecomputer(s) 1248 can be a workstation, a server computer, a router, apersonal computer, portable computer, microprocessor-based entertainmentappliance, a peer device or other common network node, and typicallyincludes many or all of the elements described relative to the computer1202, although, for purposes of brevity, only a memory/storage device1250 is illustrated. The logical connections depicted includewired/wireless connectivity to a local area network (LAN) 1252 and/orlarger networks, e.g., a wide area network (WAN) 1254. Such LAN and WANnetworking environments are commonplace in offices and companies, andfacilitate enterprise-wide computer networks, such as intranets, all ofwhich may connect to a global communications network, e.g., theInternet.

When used in a LAN networking environment, the computer 1202 isconnected to the local network 1252 through a wired and/or wirelesscommunication network interface or adapter 1256. The adaptor 1256 mayfacilitate wired or wireless communication to the LAN 1252, which mayalso include a wireless access point disposed thereon for communicatingwith the wireless adaptor 1256.

When used in a WAN networking environment, the computer 1202 can includea modem 1258, or is connected to a communications server on the WAN1254, or has other means for establishing communications over the WAN1254, such as by way of the Internet. The modem 1258, which can beinternal or external and a wired or wireless device, is connected to thesystem bus 1208 via the serial port interface 1242. In a networkedenvironment, program modules depicted relative to the computer 1202, orportions thereof, can be stored in the remote memory/storage device1250. It will be appreciated that the network connections shown areexemplary and other means of establishing a communications link betweenthe computers can be used.

The computer 1202 is operable to communicate with any wireless devicesor entities operatively disposed in wireless communication, e.g., aprinter, scanner, desktop and/or portable computer, portable dataassistant, communications satellite, any piece of equipment or locationassociated with a wirelessly detectable tag (e.g., a kiosk, news stand,restroom), and telephone. This includes at least Wi-Fi and Bluetooth™wireless technologies. Thus, the communication can be a predefinedstructure as with a conventional network or simply an ad hoccommunication between at least two devices.

Wi-Fi, or Wireless Fidelity, allows connection to the Internet from acouch at home, a bed in a hotel room, or a conference room at work,without wires. Wi-Fi is a wireless technology similar to that used in acell phone that enables such devices, e.g., computers, to send andreceive data indoors and out; anywhere within the range of a basestation. Wi-Fi networks use radio technologies called IEEE 802.11 (a, b,g, etc.) to provide secure, reliable, fast wireless connectivity. AWi-Fi network can be used to connect computers to each other, to theInternet, and to wired networks (which use IEEE 802.3 or Ethernet).Wi-Fi networks operate in the unlicensed 2.4 and 5 GHz radio bands, atan 11 Mbps (802.11a) or 54 Mbps (802.11b) data rate, for example, orwith products that contain both bands (dual band), so the networks canprovide real-world performance similar to the basic 10BaseT wiredEthernet networks used in many offices.

Referring now to FIG. 13, there is illustrated a schematic block diagramof an exemplary computing environment 1300 that can process anonymoustypes in accordance with another aspect. The system 1300 includes one ormore client(s) 1302. The client(s) 1302 can be hardware and/or software(e.g., threads, processes, computing devices). The client(s) 1302 canhouse cookie(s) and/or associated contextual information by employingthe subject innovation, for example.

The system 1300 also includes one or more server(s) 1304. The server(s)1304 can also be hardware and/or software (e.g., threads, processes,computing devices). The servers 1304 can house threads to performtransformations by employing the invention, for example. One possiblecommunication between a client 1302 and a server 1304 can be in the formof a data packet adapted to be transmitted between two or more computerprocesses. The data packet may include a cookie and/or associatedcontextual information, for example. The system 1300 includes acommunication framework 1306 (e.g., a global communication network suchas the Internet) that can be employed to facilitate communicationsbetween the client(s) 1302 and the server(s) 1304.

Communications can be facilitated via a wired (including optical fiber)and/or wireless technology. The client(s) 1302 are operatively connectedto one or more client data store(s) 1308 that can be employed to storeinformation local to the client(s) 1302 (e.g., cookie(s) and/orassociated contextual information). Similarly, the server(s) 1304 areoperatively connected to one or more server data store(s) 1310 that canbe employed to store information local to the servers 1304.

What has been described above includes examples of the disclosedinnovation. It is, of course, not possible to describe every conceivablecombination of components and/or methodologies, but one of ordinaryskill in the art may recognize that many further combinations andpermutations are possible. Accordingly, the innovation is intended toembrace all such alterations, modifications and variations that fallwithin the spirit and scope of the appended claims. Furthermore, to theextent that the term “includes” is used in either the detaileddescription or the claims, such term is intended to be inclusive in amanner similar to the term “comprising” as “comprising” is interpretedwhen employed as a transitional word in a claim.

1. A computer-implemented method of compiling a query operation,comprising: using a compiler that interacts with a processor of acomputing system to: initiate a compile process on a query; infer acomposite data type from one or more expressions in the query; convertthe inferred composite data type into a statically typed query that is astructurally compatible nominal type, wherein the statically typed queryis a static type and includes a nominal type; test for typecompatibility of the nominal type and a non-denotable anonymous type ofthe query, wherein testing for compatibility is performed based at leastin part on a relationship between the non-denotable anonymous type and amember of the nominal type; and convert an unrealized structural type toa synthesized nominal type, wherein the synthesized nominal type isgenerated by creating a normal class definition comprising at least oneof a field associated with a member of one or more members of thenon-denotable anonymous type or a property associated with the member ofthe one or more members of the non-denotable anonymous type.
 2. Thecomputer-implemented method of claim 1, further comprising automaticallygenerating the non-denotable anonymous type in response to the query. 3.The computer-implemented method of claim 1, wherein the non-denotableanonymous type is created inside a method.
 4. The computer-implementedmethod of claim 3, wherein the non-denotable anonymous type is notexposed outside the method.
 5. The computer-implemented method of claim1, wherein the synthesized nominal type implements at least one of anEquals method or a GetHashCode method.
 6. The computer-implementedmethod of claim 1, wherein the one or more expressions in the queryinclude a Select operator followed by a definition of the non-denotableanonymous type.
 7. The computer-implemented method of claim 1, furthercomprising converting the non-denotable anonymous type into thestatically typed query that includes the nominal type.
 8. Thecomputer-implemented method of claim 7, wherein the non-denotableanonymous type includes one or more values and the nominal type includesall of the one or more values.
 9. The computer-implemented method ofclaim 1, wherein testing for type compatibility is based at least inpart on a relationship between a field and a member.
 10. Acomputer-implemented method of processing a query operation, comprising:receiving a query as a query expression; processing the query expressionusing one or more processors of a computing system to thereby output anon-denotable anonymous type, wherein the non-denotable anonymous typeis not declared by a programmer, and wherein the non-denotable anonymoustype is a composite data type generated on behalf of the programmerbased on, at least in part, the query expression, which query expressionis assigned to a variable, the query expression including a Selectoperator followed by a definition of the non-denotable anonymous type;and converting the non-denotable anonymous type into a statically typedquery that includes a nominal type, wherein converting the non-denotableanonymous type ensures consistent use of variables at based on, at leastin part, the nominal type.
 11. The computer-implemented method of claim10, wherein the non-denotable anonymous type includes one or more valuessuch that converting the non-denotable anonymous type converts thenon-denotable anonymous type into a nominal type having all of the oneor more values.
 12. The computer-implemented method of claim 10, furthercomprising converting an unrealized structural type into a nominal typeusing type inference.
 13. The computer-implemented method of claim 10,further comprising converting an unrealized structural type into asynthesized nominal type.
 14. The computer-implemented method of claim10, further comprising testing for type compatibility of a nominal typeand an unrealized non-denotable anonymous type based in part on arelationship between a field and a member.
 15. The computer-implementedmethod of claim 10, wherein the non-denotable anonymous type is bound toa type variable.
 16. The computer-implemented method of claim 10,wherein the non-denotable anonymous type is defined at least in part bythe following syntax: primary-no-array-creation-expression: . . .anonymous-object-creation-expressionanonymous-object-creation-expression: new anonymous-object-initializeranonymous-object-initializer: {member-declarator-listopt}{member-declarator-list} member-declarator-list: member-declaratormember-declarator-list, member-declarator member-declarator: simple-namemember-access identifier=expression
 17. The computer-implemented methodof claim 10, wherein the non-denotable anonymous type is output inside amethod.
 18. The computer-implemented method of claim 17, wherein thenon-denotable anonymous type is not exposed outside the method.
 19. Thecomputer-implemented method of claim 10, further comprising representingthe non-denotable anonymous type by a synthesized nominal typeimplementing at least one of an Equals method or a GetHashCode method.20. A computer-readable storage medium having stored thereon computerexecutable instructions that, when executed by one or more processors ofa computing system, cause the computing system to perform the method ofclaim 10.